Curvature-Constrained Shortest Paths in a Convex Polygon
نویسندگان
چکیده
منابع مشابه
Curvature-Constrained Shortest Paths in a Convex Polygon
Let B be a point robot moving in the plane, whose path is constrained to have curvature at most 1, and let P be a convex polygon with n vertices. We study the collision-free, optimal path-planning problem forB moving between two configurations insideP (a configuration specifies both a location and a direction of travel). We present an O(n2 log n) time algorithm for determining whether a collisi...
متن کاملReachability by paths of bounded curvature in a convex polygon
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P , we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n) time algorithm to co...
متن کاملEuclidean Shortest Paths in a Simple Polygon
Let p and q be two points in a simple polygon Π. This chapter provides two rubberband algorithms for computing a shortest path between p and q that is contained in Π. The two algorithms use previously known results on triangular or trapezoidal decompositions of simple polygons, and have either O (n) or O (n log n) time complexity (where the super-linear time complexity is only due to preprocess...
متن کاملResource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theoretical and experimental results for CSP. In the theoretical part we present the hull approach, a combinatorial algorithm for solving a linear programming relaxation and prove that it runs in polynomial time in the case...
متن کاملk-Pairs Non-Crossing Shortest Paths in a Simple Polygon
This paper presents a simple O(n + k) time algorithm to compute the set of k non-crossing shortest paths between k source-destination pairs of points on the boundary of a simple polygon of n vertices. Paths are allowed to overlap but are not allowed to cross in the plane. A byproduct of this result is an O(n) time algorithm to compute a balanced geodesic triangulation which is easy to implement...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2002
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539700374550